Global convergence of a non-convex Douglas-Rachford iteration

نویسندگان

  • Francisco J. Aragón Artacho
  • Jonathan M. Borwein
چکیده

maximal monotone operator theory has recently turned fifty years old. In the first part of the talk, I shall try to explain why maximal(ly) monotone operators are both interesting and important objects while briefly survey the history of the subject — culminating with a description of the remarkable progress made during the past decade. In the second part of the talk, I shall describe in more detail some of the recent striking results on the structure of monotone operators in nonreflexive space.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Douglas-Rachford Algorithm for Weakly Convex Penalties

The Douglas-Rachford algorithm is widely used in sparse signal processing for minimizing a sum of two convex functions. In this paper, we consider the case where one of the functions is weakly convex but the other is strongly convex so that the sum is convex. We provide a condition that ensures the convergence of the same Douglas-Rachford iterations, provided that the strongly convex function i...

متن کامل

The Douglas-Rachford algorithm in the absence of convexity

The Douglas-Rachford iteration scheme, introduced half a century ago in connection with nonlinear heat flow problems, aims to find a point common to two or more closed constraint sets. Convergence of the scheme is ensured when the sets are convex subsets of a Hilbert space, however, despite the absence of satisfactory theoretical justification, the scheme has been routinely used to successfully...

متن کامل

A Cyclic Douglas-Rachford Iteration Scheme

In this paper we present two Douglas–Rachford inspired iteration schemes which can be applied directly to N-set convex feasibility problems in Hilbert space. Our main results are weak convergence of the methods to a point whose nearest point projections onto each of the N sets coincide. For affine subspaces, convergence is in norm. Initial results from numerical experiments, comparing our metho...

متن کامل

Lecture 20 : Splitting Algorithms

In this lecture, we discuss splitting algorithms for convex minimization problems with objective given by the sum of two nonsmooth functions. We start with the fixed point property of such problems and derive a general scheme of splitting algorithm based on fixed point iteration. This covers Douglas-Rachford splitting and Peaceman-Rachford splitting algorithms. We also discuss the convergence r...

متن کامل

Norm Convergence of Realistic Projection and Reflection Methods

The (2-set) convex feasibility problem asks for a point contained within the intersection of two closed convex sets of a Hilbert space. Projection and reflection methods represent a class of algorithmic schemes which are commonly used to solve this problem. Some notable projection and reflection methods include the method of alternating projections, the Douglas–Rachford method, the cyclic Dougl...

متن کامل

Global behavior of the Douglas-Rachford method for a nonconvex feasibility problem

In recent times the Douglas–Rachford algorithm has been observed empirically to solve a variety of nonconvex feasibility problems including those of a combinatorial nature. For many of these problems current theory is not sufficient to explain this observed success and is mainly concerned with questions of local convergence. In this paper we analyze global behavior of the method for finding a p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Global Optimization

دوره 57  شماره 

صفحات  -

تاریخ انتشار 2013